- Title
- A multistage protocol for aggregated queries in distributed cloud databases with privacy protection
- Creator
- Kelarev, Andrei; Yi, Xun; Badsha, Shahriar; Yang, Xuechao; Rylands, Leanne; Seberry, Jennifer
- Relation
- ARC.DP160100913 http://purl.org/au-research/grants/arc/DP160100913
- Relation
- Future Generation Computer Systems Vol. 90, Issue January, p. 368-380
- Publisher Link
- http://dx.doi.org/10.1016/j.future.2018.08.017
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2019
- Description
- This article is devoted to the novel situation, where a large distributed cloud database is a union of several separate databases belonging to individual database owners who are not allowed to transfer their data for storage in locations different from their already chosen separate cloud service providers. For example, a very large number of medical records may be stored in a distributed cloud database, which is a union of several separate databases from different hospitals, or even from different countries. The owners of the databases may need to provide answers to certain common aggregated queries using all information available without sharing or transferring all data. It is necessary to minimize the communication costs, improve efficiency, and comply with the legal requirements protecting the privacy of confidential data. In this situation, it is impossible to aggregate the whole database in one location, but effective methods for answers to the aggregated queries with privacy protection are required. To solve this important problem, the present article proposes a Multistage Separate Query Processing (MSQP) protocol employing homomorphic encryption with split keys. We show that our protocol can answer a large class of natural queries of practical significance. The running time of the MSQP protocol is O(d + m/d), where d is the number of database owners and m is the total number of records in the whole database. In practice, d is small, m can be very large, and so the running time is Om. This means that the protocol is very efficient for large databases. It dramatically reduces the communication costs of computation and completely eliminates the need for exchange of confidential data. We define a new generalized additive homomorphic property and introduce a Multipart ElGamal Cryptosystem (MEC) with split keys, which enjoys this property. MEC is a novel modification of the ElGamal cryptosystem with split keys. This paper presents the results of extensive experiments evaluating the effectiveness of the MSQP protocol employing MEC and comparing it with MSQP employing the ElGamal cryptosystem, for a collection of publicly available medical datasets. The experiments evaluating our protocol on 11 real-life databases and a synthetic database demonstrate that the MSQP protocol employing MEC is more efficient than other options and can be recommended for practical implementations.
- Subject
- cloud services; privacy protection; distributed databases; generalized homomorphic property; split keys; multipart elGamal cryptosystem
- Identifier
- http://hdl.handle.net/1959.13/1401037
- Identifier
- uon:34860
- Identifier
- ISSN:0167-739X
- Rights
- ©2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
- Language
- eng
- Full Text
- Reviewed
- Hits: 3669
- Visitors: 4745
- Downloads: 283
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 2 MB | Adobe Acrobat PDF | View Details Download |